Reliability Evaluation and Diagnostics with Propositional Directed Acyclic Graphs
نویسندگان
چکیده
The theories of reliability and diagnostics, despite their close relationship, have been mostly treated as two separate fields in the literature. However, it has been shown in the past few years that their dual character can be exploited in the context of modular systems. Such systems have a great practical impact on reliability computation and diagnostics, since their structure can be used to significantly reduce the computational effort needed for their evaluation. It is also known that the underlying structure function can be represented in a compact way by Propositional Directed Acyclic Graphs (PDAGs), which form a powerful Boolean representation language. Recently, PDAGs have been also applied successfully in the context of network reliability. The present paper continues this line of research and proposes several extensions. First, we introduce a unifying formal model for system description, reliability evaluation, and diagnostics. Besides the formal specification of modular systems and reliability networks, the model allows networks and modules to be combined arbitrarily, leading to so-called hybrid systems. The underlying computational machinery provided by PDAGs allows to evaluate reliability in a convenient and efficient way. Second, we provide concise algorithms for both generating structure functions with respect to network reliability problems as well as for PDAG manipulations, and we also examine their complexity. Third, we show that posterior probabilities of system elements can be efficiently computed using PDAGs for diagnostic purposes, in particular in modular systems.
منابع مشابه
Network Reliability Evaluation with Propositional Directed Acyclic Graphs1
This paper proposes a new and flexible approach for network reliability computation. The method is based on Propositional Directed Acyclic Graphs (PDAGs), a general graph-based language for the representation of Boolean functions. We introduce an algorithm which creates in polynomial time a generic structure function representation for reliability networks. In contrast to many existing methods,...
متن کاملRepresenting Boolean Functions with Propositional Directed Acyclic Graphs
Propositional directed acyclic graphs (PDAG) continue the line of research on knowledge compilation in the context of Negational Normal Forms (NNF) and Binary Decision Diagrams (BDD). This paper summarizes previous results and open problems concerning knowledge representation based on PDAG and its sub-languages. In addition, it gives a short introduction to some application areas.
متن کاملMulti-state Directed Acyclic Graphs
This paper continues the line of research on the representation and compilation of propositional knowledge bases with propositional directed acyclic graphs (PDAG), negation normal forms (NNF), and binary decision diagrams (BDD). The idea is to permit variables with more than two states and to explicitly represent them in their most natural way. The resulting representation languages are analyze...
متن کاملOn the Quest for an Acyclic Graph
The paper aims at finding acyclic graphs under a given set of constraints. More specifically, given a propositional formula φ over edges of a fixed-size graph, the objective is to find a model of φ that corresponds to a graph that is acyclic. The paper proposes several encodings of the problem and compares them in an experimental evaluation using stateof-the-art SAT solvers.
متن کاملA new 3-CNF transformation by parallel-serial graphs
For propositional formulas we present a new transformation into satisfiability equivalent 3-CNF formulas of linear length. The main idea is to represent formulas as parallel-serial graphs. This is a subclass of directed acyclic multigraphs where the edges are labeled with literals and the AND operation (respectively, the OR operation) is expressed as parallel (respectively, serial) connection.
متن کامل